Performance Evaluation of Mobile Ad Hoc Networks Using Routing with Selfish Nodes

In mobile ad hoc networks (MANETs)[1], a mobile station (MS) can communicate with nodes outside of its transmission range by employing intermediate nodes as relays. To find a path to a specific destination node, the source node broadcasts route request packets that are forwarded to all other nodes. A simple flooding scheme is employed in AODV [2], where every node rebroadcasts these route request packets even if some of its neighbors have already broadcast the requests and thus the rebroadcasts may reach no additional nodes. Appropriate use of a probabilistic method can reduce the number of rebroadcasting; therefore reduce the chance of contention and collision among neighboring nodes. A good probabilistic broadcast protocol can achieve higher throughput and lower energy consumption, without sacrificing reach ability or having any significant degradation. In this paper, we propose a selfish node based approach.